A randomized competitive algorithm for evaluating priced AND/OR treesSANY LABER, Eduardo.Theoretical computer science. 2008, Vol 401, Num 1-3, pp 120-130, issn 0304-3975, 11 p.Article

The complexity of makespan minimization for pipeline transportationMILIDIU, Ruy Luiz; ALVES PESSOA, Artur; SANY LABER, Eduardo et al.Theoretical computer science. 2003, Vol 306, Num 1-3, pp 339-351, issn 0304-3975, 13 p.Article

A strategy for searching with different access costsSANY LABER, Eduardo; MILIDIU, Ruy Luiz; ALVES PESSOA, Artur et al.Theoretical computer science. 2002, Vol 287, Num 2, pp 571-584, issn 0304-3975, 14 p.Conference Paper

On behalf of the seller and society : Bicriteria mechanisms for unit-demand auctionsBORNSTEIN, Claudson; SANY LABER, Eduardo; MAS, Marcelo et al.Lecture notes in computer science. 2006, pp 211-223, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper

Efficient algorithms for the hotlink assignment problem: The worst case searchALVES PESSOA, Artur; SANY LABER, Eduardo; DE SOUZA, Criston et al.Lecture notes in computer science. 2004, pp 778-792, issn 0302-9743, isbn 3-540-24131-0, 15 p.Conference Paper